Technical Note—A Note on Zero-One Programming

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comprehensive Model for R and D Project Portfolio Selection with Zero-One Linear Goal-Programming (RESEARCH NOTE)

Technology centered organizations must be able to identify promising new products or process improvements at an early stage so that the necessary resources can be allocated to those activities. It is essential to invest in targeted research and development (R and D) projects as opposed to a wide range of ideas so that resources can be focused on successful outcomes. The selection of the most ap...

متن کامل

A note on zero-one laws in metrical Diophantine approximation

q ψ(q) diverges but A(ψ) is of zero measure. In other words, without the monotonicity assumption, Khintchine’s theorem is false and the famous Duffin-Schaeffer conjecture provides the appropriate statement. The key difference is that in (1), we impose coprimality on the integers p and q. Let A(ψ) denote the resulting subset of A(ψ). The Duffin-Schaeffer conjecture states that the measure of A(ψ...

متن کامل

Convex land acquisition with zero ^ one programming

The land-acquisition problem involves selecting multiple discrete parcels to be acquired for a particular land use. In previous models, typical selection criteria have been land cost, land area, and spatial attributes such as contiguity and compactness. Here I introduce a new spatial attribute, convexity. I develop a way to approximate convex shapes in continuous space with `cellularly convex' ...

متن کامل

Continuous Reformulations for Zero-one Programming Problems

In this work, we study continuous reformulations of zero–one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero–one programming problem can be obtained by solving a specific continuous problem.

متن کامل

A zero one programming model for RNA structures with arclength ≥ 4

In this paper, we consider RNA structures with arc-length 4 . First, we represent these structures as matrix models and zero-one linearprogramming problems. Then, we obtain an optimal solution for this problemusing an implicit enumeration method. The optimal solution corresponds toan RNA structure with the maximum number of hydrogen bonds.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1975

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.23.4.833